منابع مشابه
Permutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملFast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...
متن کاملMapping algorithms for permutation networks*
The mapping problem arises when the dependency structure of a parallel algorithm differs from the interconnection of processors in the intended parallel computer (topological variation) or, when the number of processes required by the algorithm exceeds the number of processors available in the computer (cardinality variation). The problem discussed in this paper is to identify a distributed com...
متن کاملFINDING HIGHLY PROBABLE DIFFERENTIAL CHARACTERISTICS OF SUBSTITUTION-PERMUTATION NETWORKS USING GENETIC ALGORITHMS
In this paper, we propose a genetic algorithm, called GenSPN, for finding highly probable differential characteristics of substitution permutation networks (SPNs). A special fitness function and a heuristic mutation operator have been used to improve the overall performance of the algorithm. We report our results of applying GenSPN for finding highly probable differential characteristics of Ser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1978
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/21.4.296